The spectral dimension of random brushesJONSSON, Thordur; ÖRN STEFANSSON, Sigurour.Journal of physics. A, Mathematical and theoretical (Print). 2008, Vol 41, Num 4, issn 1751-8113, 045005.1-045005.10Article

The random linear bottleneck assignment problemPFERSCHY, U.RAIRO. Recherche opérationnelle. 1996, Vol 30, Num 2, pp 127-142, issn 0399-0559Article

A geometric growth model interpolating between regular and small-world networksZHONGZHI ZHANG; SHUIGENG ZHOU; ZHIYONG WANG et al.Journal of physics. A, Mathematical and theoretical (Print). 2007, Vol 40, Num 39, pp 11863-11876, issn 1751-8113, 14 p.Article

Pre-processing and linear-decomposition algorithm to solve the k-colorability problemLUCET, Corinne; MENDES, Florence; MOUKRIM, Aziz et al.Lecture notes in computer science. 2004, pp 315-325, issn 0302-9743, isbn 3-540-22067-4, 11 p.Conference Paper

On distance-preserving and domination elimination orderingsCHEPOI, V.SIAM journal on discrete mathematics (Print). 1998, Vol 11, Num 3, pp 414-436, issn 0895-4801Article

Improving Taguchi's packaging of fractional factorial designsROBINSON, G. K.Journal of quality technology. 1993, Vol 25, Num 1, pp 1-11, issn 0022-4065Article

Adding an edge in a cographNIKOLOPOULOS, Stavros D; PALIOS, Leonidas.Lecture notes in computer science. 2005, pp 214-226, issn 0302-9743, isbn 3-540-31000-2, 1Vol, 13 p.Conference Paper

A conjecture of Berge about linear hypergraphs and Steiner systems S(2,4,v)GIONFRIDDO, Lucia.Discrete mathematics. 2002, Vol 255, Num 1-3, pp 125-133, issn 0012-365XConference Paper

A coding approach to signed graphsSOLE, P; ZASLAVSKY, T.SIAM journal on discrete mathematics (Print). 1994, Vol 7, Num 4, pp 544-553, issn 0895-4801Article

THE LINEAR ARBORICITY OF GRAPHS ON SURFACES OF NEGATIVE EULER CHARACTERISTICWU, Jian-Liang.SIAM journal on discrete mathematics (Print). 2010, Vol 23, Num 1, pp 54-58, issn 0895-4801, 5 p.Article

Maximal models of assertion graph in GSTEGUOWU YANG; JIN YANG; XIAOYU SONG et al.Lecture notes in computer science. 2006, pp 684-693, issn 0302-9743, isbn 3-540-34021-1, 1Vol, 10 p.Conference Paper

Distance between kohonen classes visualization tool to use SOM in data set analysis and representationROUSSET, Patrick; GUINOT, Christiane.Lecture notes in computer science. 2001, issn 0302-9743, isbn 3-540-42235-8, part II, 119-126Conference Paper

A linear-time algorithm for the weighted feedback vertex problem on interval graphsCHIN LUNG LU; CHUAN YI TANG.Information processing letters. 1997, Vol 61, Num 2, pp 107-111, issn 0020-0190Article

A mixed limit theorem for stable random fieldsKURIEN, T. V; JAYARAM SETHURAMAN.Journal of multivariate analysis. 1993, Vol 47, Num 1, pp 152-162, issn 0047-259XArticle

Graphs, causality, and stabilizability: linear, shift-invariant systems of L₂[0,∞GEORGIOU, T. T; SMITH, M. C.MCSS. Mathematics of control, signals and systems. 1993, Vol 6, Num 3, pp 195-223, issn 0932-4194Article

Linear Inequalities Among Graph Invariants : Using GraPHedron to Uncover Optimal RelationshipsCHRISTOPHE, Julie; DEWEZ, Sophie; DOIGNON, Jean-Paul et al.Networks (New York, NY). 2008, Vol 52, Num 4, pp 287-298, issn 0028-3045, 12 p.Article

A sharpening of Fisher's inequalityFRANKL, P; FÜREDI, Z.Discrete mathematics. 1991, Vol 90, Num 1, pp 103-107, issn 0012-365XArticle

A limit theorem for pattern synthesis in image processingYUNSHYONG CHOW.Journal of multivariate analysis. 1990, Vol 34, Num 1, pp 75-94, issn 0047-259XArticle

An exact method for graph coloringLUCET, C; MENDES, F; MOUKRIM, A et al.Computers & operations research. 2006, Vol 33, Num 8, pp 2189-2207, issn 0305-0548, 19 p.Article

New cryptographic applications of boolean function equivalence classesMILLAN, William L.Lecture notes in computer science. 2005, pp 572-583, issn 0302-9743, isbn 3-540-26547-3, 12 p.Conference Paper

Computing common intervals of K permutations, with applications to modular decomposition of graphsBERGERON, Anne; CHAUVE, Cedric; DE MONTGOLFIER, Fabien et al.Lecture notes in computer science. 2005, pp 779-790, issn 0302-9743, isbn 3-540-29118-0, 1Vol, 12 p.Conference Paper

Decentralized event-triggered consensus with general linear dynamicsGARCIA, Eloy; YONGCAN CAO; CASBEER, David Wellman et al.Automatica (Oxford). 2014, Vol 50, Num 10, pp 2633-2640, issn 0005-1098, 8 p.Article

Learning Bayesian network structure: Towards the essential graph by integer linear programming toolsSTUDENY, Milan; HAWS, David.International journal of approximate reasoning. 2014, Vol 55, Num 4, pp 1043-1071, issn 0888-613X, 29 p.Conference Paper

On the Problem of Reconstructing an Unknown Topology via Locality Properties of the Wiener FilterMATERASSI, Donatello; SALAPAKA, Murti V.IEEE transactions on automatic control. 2012, Vol 57, Num 7, pp 1765-1777, issn 0018-9286, 13 p.Article

On the complexity of some colorful problems parameterized by treewidthFELLOWS, Michael R; FOMIN, Fedor V; LOKSHTANOV, Daniel et al.Information and computation (Print). 2011, Vol 209, Num 2, pp 143-153, issn 0890-5401, 11 p.Article